Sets whose differences avoid squares modulo

نویسندگان

چکیده

We prove that if ε ( m stretchy="false">) stretchy="false">→ 0 \varepsilon (m)\to 0 arbitrarily slowly, then for almost all alttext="m"> encoding="application/x-tex">m and any alttext="upper A subset-of double-struck upper Z Subscript m"> A ⊂<!-- ⊂ <mml:msub> Z encoding="application/x-tex">A\subset \mathbb {Z}_m such minus A"> −<!-- − encoding="application/x-tex">A-A does not contain non-zero quadratic residues we have alttext="StartAbsoluteValue EndAbsoluteValue less-than-or-slanted-equals Superscript 1 slash 2 epsilon Baseline period"> stretchy="false">| ⩽<!-- ⩽ <mml:msup> 1 / 2 . encoding="application/x-tex">|A|\leqslant m^{1/2-\varepsilon (m)}.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Codes Through Latin Squares Modulo n

It is known that t mutually orthogonal latin squares of order n generate a b t 2c-error correcting code with n codewords. In this paper we consider latin squares of order n made up of elements taken from Zn. In this situation we consider when this code is linear. We present neccessary and sufficient conditions on the latin squares and obtain a method of constructing a maximal family of mutually...

متن کامل

On Sets of Natural Numbers Whose Difference Set Contains No Squares

We show that if a sequence s/ of natural numbers has no pair of elements whose difference is a positive square, then the density of J / n{l , . . . ,«} is O(l/log«)»), cn->-oo. This improves previous results which showed that the density converges to zero, but at a slower rate. We use a technique based on the method of Hardy and Littlewood together with a combinatorial result that is of indepen...

متن کامل

B2[g]SEQUENCES WHOSE TERMS ARE SQUARES

INTRODUCTION Sixty years ago Sidon [7] asked, in the course of some investigations of Fourier series, for a sequence a1 < a2... for which the sums ai + aj are all distinct and for which ak tends to infinity as slowly as possible. Sidon called these sequences, B2 sequences. The greedly algorithm gives ak ¿ k and this was the best result until Atjai, Komlos and Szemeredi [1] found a B2 sequence s...

متن کامل

On sum-free sets modulo p

Let p be a sufficiently large prime and A be a sum-free subset of Z/pZ; improving on a previous result of V. F. Lev, we show that if |A| = card(A) > 0.324p, then A is contained in a dilation of the interval [|A| , p− |A|] (mod. p).

متن کامل

Affine-evasive Sets Modulo a Prime

In this work, we describe a simple and efficient construction of a large subset S of Fp , where p is a prime, such that the set A(S) for any non-identity affine map A over Fp has small intersection with S . Such sets, called affine-evasive sets, were defined and constructed in [ADL14] as the central step in the construction of non-malleable codes against affine tampering over Fp , for a prime p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2021

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15511